package DataStructer;

import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;

class TreeNode {
    public char var;
    public TreeNode left;
    public TreeNode right;

    public TreeNode(char var) {
        this.var = var;
    }
}
// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class PriorityQueue {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNextLine()) { // 注意 while 处理多个 case
            String input = in.nextLine();
            TreeNode root = createTree(input);
            inOrderTraversal(root);
        }
    }

    public static int i = 0;
    public static TreeNode createTree(String str) {
        TreeNode root = null;

        if(str.charAt(i) != '#') {
            root = new TreeNode(str.charAt(i));
            i++;
            root.left = createTree(str);
            root.right = createTree(str);
        } else {
            i++;
        }
        return root;
    }

    public static void inOrderTraversal(TreeNode root) {
        if(root == null) {
            return;
        }
        inOrderTraversal(root.left);
        System.out.print(root.var + " ");
        inOrderTraversal(root.right);
        HashMap<String, Integer> map = new HashMap<>();
        HashSet<Integer> set = new HashSet<>();
    }
}
